INCIDENCE MATRICES WITH THE CONSECUTIVE 1's PROPERTY
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices
A 0-1 matrix has the Consecutive Ones Property (C1P) if there is a permutation of its columns that leaves the 1’s consecutive in each row. The Consecutive Ones Submatrix (COS) problem is, given a 0-1 matrix A, to find the largest number of columns of A that form a submatrix with the C1P property. Such a problem has potential applications in physical mapping with hybridization data. This paper p...
متن کاملA new characterization of matrices with the consecutive ones property
We consider the following constraint satisfaction problem: Given a set F of subsets of a finite set S of cardinality n, and an assignment of intervals of the discrete set {1, . . . , n} to each of the subsets, does there exist a bijection f : S → {1, . . . , n} such that for each element of F, its image under f is same as the interval assigned to it. An interval assignment to a given set of sub...
متن کاملLightweight 4x4 MDS Matrices for Hardware-Oriented Cryptographic Primitives
Linear diffusion layer is an important part of lightweight block ciphers and hash functions. This paper presents an efficient class of lightweight 4x4 MDS matrices such that the implementation cost of them and their corresponding inverses are equal. The main target of the paper is hardware oriented cryptographic primitives and the implementation cost is measured in terms of the required number ...
متن کاملVariants of the Consecutive-Ones Property Motivated by the Reconstruction of Ancestral Species
The polynomial-time decidable Consecutive-Ones Property (C1P) of binary matrices, formally introduced in 1965 by Fulkerson and Gross [52], has since found applications in many areas. In this thesis, we propose and study several variants of this property that are motivated by the reconstruction of ancestral species. We first propose the Gapped C1P, or the (k,δ )-Consecutive-Ones Property ((k,δ )...
متن کاملA network flow algorithm to minimize beam-on time for unconstrained multileaf collimator problems in cancer radiation therapy
In this article, we study the modulation of intensity matrices arising in cancer radiation therapy using multileaf collimators. This problem can be formulated by decomposing a given m n integer matrix into a positive linear combination of (0, 1) matrices with the strict consecutive 1’s property in rows. We consider a special case in which no technical constraints have to be taken into account. ...
متن کامل